Search of Fractal Space-Filling Curves with Minimal Dilation
نویسندگان
چکیده
We introduce an algorithm for a search of extremal fractal curves in large curve classes. It heavily uses SAT-solvers—heuristic algorithms that find models CNF boolean formulas. Our was implemented and applied to the surjective $$\gamma :[0,1]\rightarrow [0,1]^d$$ with minimal dilation $$\begin{aligned} \sup _{t_1<t_2}\frac{\Vert \gamma (t_2)-\gamma (t_1)\Vert ^d}{t_2-t_1}. \end{aligned}$$ report new results case Euclidean norm. have found we call “YE”, self-similar (monofractal) plane genus $$5\times 5$$ $$5+{43}/{73}=5.5890\ldots $$ In dimension 3 facet-gated bifractals (which “Spring”) $$2\times 2\times 2$$ $$<17$$ . 4 obtained there is $$<62$$ Some lower bounds on wider classes cubically decomposable are proven.
منابع مشابه
Exhaustive Geographic Search with Mobile Robots Along Space-Filling Curves
Swarms of mobile robots can be tasked with searching a geographic region for targets of interest, such as buried land mines. We assume that the individual robots are equipped with sensors tuned to the targets of interest, that these sensors have limited range, and that the robots can communicate with one another to enable cooperation. How can a swarm of cooperating sensate robots efficiently se...
متن کاملHigh Dimensional Similarity Search With Space Filling Curves
We present a new approach for approximate nearest neighbor queries for sets of high dimensional points under any L t-metric, t = 1; : : : ; 1. The proposed algorithm is eecient and simple to implement. The algorithm uses multiple shifted copies of the data points and stores them in up to (d + 1) B-trees where d is the dimensionality of the data, sorted according to their position along a space ...
متن کاملUnconventional Space-filling Curves
A 2-dimensional space-filling curve, here, is a surjective continuous map from an interval to a 2-dimensional space. To construct a new space-filling curve distinct and much different from Hilbert’s, Peano’s, and the Z-order, we first observe that all three of these curves are based on self-similar fractals–in particular, the recursive definition of the sequences of functions that converge to t...
متن کاملClustering Microarray Data with Space Filling Curves
We introduce a new clustering method for DNA microarray data that is based on space filling curves and wavelet denoising. The proposed method is much faster than the established fuzzy c-means clustering because clustering occurs in one dimension and it clusters cells that contain data, instead of data themselves. Moreover, preliminary evaluation results on data sets from Small Round Blue-Cell t...
متن کاملImage Encryption with Space - filling Curves
Conventional encryption techniques are usually applicable for text data and often unsuited for encrypting multimedia objects for two reasons. Firstly, the huge sizes associated with multimedia objects make conventional encryption computationally costly. Secondly, multimedia objects come with massive redundancies which are useful in avoiding encryption of the objects in their entirety. Hence a c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete and Computational Geometry
سال: 2022
ISSN: ['1432-0444', '0179-5376']
DOI: https://doi.org/10.1007/s00454-022-00444-2